|
In computer programming, bidirectional transformations (bx) are programs in which a single piece of code can be run in several ways, such that the same data are sometimes considered as input, and sometimes as output. For example, a bx run in the forward direction might transform input I into output O, while the same bx run backward would take as input versions of I and O and produce a new version of I as its output. Bidirectional model transformations are an important special case in which a model is input to such a program. Some bidirectional languages are ''bijective''. The bijectivity of a language is a severe restriction of its bidirectionality,〔http://grace.gsdlab.org/images/e/e2/Nate-short.pdf〕 because a bijective language is merely relating two different ways to present the very same information. More general is a lens language, in which there is a distinguished forward direction ("get") that takes a concrete input to an abstract output, discarding some information in the process: the concrete state includes all the information that is in the abstract state, and usually some more. The backward direction ("put") takes a concrete state and an abstract state and computes a new concrete state. Lenses are required to obey certain conditions to ensure sensible behaviour. The most general case is that of symmetric bidirectional transformations. Here the two states that are related typically share some information, but each also includes some information that is not included in the other. == Usage == Bidirectional transformations can be used to: * Maintain several sources of information consistent〔http://www.cs.cornell.edu/~jnfoster/papers/grace-report.pdf〕 * Provide an 'abstract view' to easily manipulate data and write them back to their source 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「bidirectional transformation」の詳細全文を読む スポンサード リンク
|